Diagnosing a Strong-Fault Model by Conflict and Consistency
نویسندگان
چکیده
منابع مشابه
Solving Strong-Fault Diagnostic Models by Model Relaxation
In Model-Based Diagnosis (MBD), the problem of computing a diagnosis in a strong-fault model (SFM) is computationally much harder than in a weak-fault model (WFM). For example, in propositional Horn models, computing the first minimal diagnosis in a weak-fault model (WFM) is in P but is NP-hard for strong-fault models. As a result, SFM problems of practical significance have not been studied in...
متن کاملStrong fault - tolerant conflict - free coloring ( Strong FTCF Coloring ) for intervals
Given a set of points P, a conflict-free coloring of P is an assignment of colors to points of P, such that there exist a point p in any subset of P whose color is distinct from all other points in that subset of P. This notion is motivated by frequency assignment in wireless cellular networks: one would like to minimize the number of frequencies (colors) assigned to base stations (points), suc...
متن کاملA framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes
In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We develop a modular and reusable framework for verifying the correctness of CRDT algorithms. We avoid correctness issues that have dogged previous mechanised proofs in this area by including a network model in o...
متن کاملStrong Consistency at Scale
Today’s online services must meet strict availability and performance requirements. State machine replication, one of the most fundamental approaches to increasing the availability of services without sacrificing strong consistency, provides configurable availability but limited performance scalability. Scalable State Machine Replication (S-SMR) achieves scalable performance by partitioning the...
متن کاملa generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2018
ISSN: 1424-8220
DOI: 10.3390/s18041016